Browsing by Subject "Branch and bound algorithms"
Now showing items 1-2 of 2
-
(Texas A&M University. Libraries, 1980)In this dissertation, an algorithm was developed to solve large scale discrete nonlinear knapsack problems (NKP) with multiple resource constraints. The algorithm is essentially a dynamic programming technique in a sense ...
-
(Texas A&M University. Libraries, 1988)This dissertation deals with branch and bound algorithms which are applied to the two-machine flow-shop problem with sparse precedence constraints and the optimal sequencing and scheduling of multiple feedstocks in a batch ...